On the Convergence of GMRES with Invariant-Subspace Deflation

نویسندگان

  • C. Vuik
  • M. C. Yeung
چکیده

We consider the solution of large and sparse linear systems of equations by GMRES. Due to the appearance of unfavorable eigenvalues in the spectrum of the coefficient matrix, the convergence of GMRES may hamper. To overcome this, a deflated variant of GMRES can be used, which treats those unfavorable eigenvalues effectively. In the literature, several deflated GMRES variants are applied successfully to various problems, while a theoretical justification is often lacking. In contrast to deflated CG, the convergence of deflated GMRES seems to be harder to analyze and to understand. This paper presents some new theoretical insights into deflated GMRES based on A-invariant deflation subspaces. Fundamental results regarding the convergence of deflated GMRES are proved in order to show the effectiveness and robustness of this method. Numerical experiments are provided to illustrate the theoretical results and to show some further properties of deflated GMRES. Consequently, practical variants of deflated GMRES from the literature can be better understood based on the results presented in this paper. University of Wyoming, Department of Mathematics, 1000 East University Avenue Laramie, WY 82071, USA ([email protected]), This research was supported by Flittie Sabbatical Augmentation Award, University of Wyoming. University of Minnesota, Department of Computer Science and Engineering, 200 Union Street S.E, Minneapolis, MN 55455, USA ([email protected]), Work supported in part by DOE under grant DE-FG 08ER 25841. Delft University of Technology, Faculty of Electrical Engineering, Mathematics and Computer Science, Delft Institute of Applied Mathematics, P.O. Box 5031, 2600 GA Delft, The Netherlands, ([email protected])

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Stability of Gmres Convergence, with Application to Approximate Deflation Preconditioning

How does GMRES convergence change when the coefficient matrix is perturbed? Using spectral perturbation theory and resolvent estimates, we develop simple, general bounds that quantify the lag in convergence such a perturbation can induce. This analysis is particularly relevant to preconditioned systems, where an ideal preconditioner is only approximately applied in practical computations. To il...

متن کامل

GMRES Convergence for Perturbed Coefficient Matrices, with Application to Approximate Deflation Preconditioning

How does GMRES convergence change when the coefficient matrix is perturbed? Using spectral perturbation theory and resolvent estimates, we develop simple, general bounds that quantify the lag in convergence such a perturbation can induce. This analysis is particularly relevant to preconditioned systems, where an ideal preconditioner is only approximately applied in practical computations. To il...

متن کامل

Preconditioned Generalized Minimal Residual Method for Solving Fractional Advection-Diffusion Equation

Introduction Fractional differential equations (FDEs)  have  attracted much attention and have been widely used in the fields of finance, physics, image processing, and biology, etc. It is not always possible to find an analytical solution for such equations. The approximate solution or numerical scheme  may be a good approach, particularly, the schemes in numerical linear algebra for solving ...

متن کامل

Deflation and Balancing Preconditioners for Krylov Subspace Methods Applied to Nonsymmetric Matrices

For quite some times, deflation preconditioner has been proposed and used to accelerate the convergence of Krylov subspace methods. For symmetric positive definite linear systems, convergence of CG combined with deflation has been analyzed and compared with other preconditioners, e.g. with the abstract balancing preconditioner [Nabben and Vuik, SIAM J. Sci. Comput., 27 (2006), pp. 1742–1759]. I...

متن کامل

Spectral Deflation in Krylov Solvers: a Theory of Coordinate Space Based Methods

For the iterative solution of large sparse linear systems we develop a theory for a family of augmented and deflated Krylov space solvers that are coordinate based in the sense that the given problem is transformed into one that is formulated in terms of the coordinates with respect to the augmented bases of the Krylov subspaces. Except for the augmentation, the basis is as usual generated by a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010